A Markov -binomial Distribution
نویسندگان
چکیده
Let {Xi, i ≥ 1} denote a sequence of {0, 1}-variables and suppose that the sequence forms a Markov Chain. In the paper we study the number of successes Sn = X1 + X2 + · · · + Xn and we study the number of experiments Y (r) up to the r-th success. In the i.i.d. case Sn has a binomial distribution and Y (r) has a negative binomial distribution and the asymptotic behaviour is well known. In the more general Markov chain case, we prove a central limit theorem for Sn and provide conditions under which the distribution of Sn can be approximated by a Poisson-type of distribution. We also completely characterize Y (r) and show that Y (r) can be interpreted as the sum of r independent r.v. related to a geometric distribution.
منابع مشابه
Multimodality of the Markov Binomial Distribution
We study the shape of the probability mass function of the Markov binomial distribution, and give necessary and sufficient conditions for the probability mass function to be unimodal, bimodal, or trimodal. These are useful to analyze the double-peaking results of a reactive transport model from the engineering literature. Moreover, we give a closedform expression for the variance of the Markov ...
متن کاملSome Representations and Specifications of the Generalized Negative Binomial Distribution
Abstract: In a sequence of dependent Bernoulli trials, the distribution of the number of trials required to obtain r successes, Vr, is called a Generalized Negative Binomial (GNB) distribution. We present a simple representation of this distribution based on moments and consider the conditions under which a GNB distribution follows negative binomial distribution. Also we study the properties of...
متن کاملOn approximation of Markov binomial distributions
For a Markov chain X = {Xi, i = 1, 2, . . . , n} with the state space {0, 1}, the random variable S := ∑n i=1 Xi is said to follow a Markov binomial distribution. The exact distribution of S, denoted as LS, is very computationally intensive for large n [see Gabriel (1959) and Bhat and Lal (1988)] and this paper concerns suitable approximate distributions for LS when X is stationary. We conclude...
متن کاملValuing Capacity Investment Decisions: Binomial vs. Markov Models
In this work, we present a model to value capacity investment decisions based on real options. In the problem considered we incorporate partial reversibility by letting the firm reverse its capital investment at a cost, both fully or partially. The standard RO approach considers the stochastic variable to be normally distributed and then approximated by a binomial distribution, resulting in a b...
متن کاملThe Markov Binomial Distribution: an Explicit Solution by a Regenerative Approach
The coefficients of the Markov binomial distribution are solved in terms of the underlying state-contingent probabilities of the Markov chain. This will be useful for researchers concerned with the analysis of data generated by a discrete Markov chain. The paper exploits the regenerative nature of the problem and solves the difference equations known to define the distribution. The LLN, CLT and...
متن کامل